On Square-Free Numbers
نویسنده
چکیده
In the article the formal characterization of square-free numbers is shown; in this manner the paper is the continuation of [19]. Essentially, we prepared some lemmas for convenient work with numbers (including the proof that the sequence of prime reciprocals diverges [1]) according to [18] which were absent in the Mizar Mathematical Library. Some of them were expressed in terms of clusters’ registrations, enabling automatization machinery available in the Mizar system. Our main result of the article is in the final section; we proved that the lattice of positive divisors of a positive integer n is Boolean if and only if n is square-free.
منابع مشابه
Numerical simulation of Laminar Free Convection Heat Transfer around Isothermal Concave and Convex Body Shapes
In the present research, free convection heat transfer from isothermal concave and convex body shapes is studied numerically. The body shapes investigated here, are bi-sphere, cylinder, prolate and cylinder with hemispherical ends; besides, they have the same height over width (H/D = 2). A Numerical simulation is implemented to obtain heat transfer and fluid flow from all of the geometries in a...
متن کاملBases and Nonbases of Square-Free Integers
A basis is a set A of nonnegative integers such that every sufficiently large integer n can be represented in the form n = a + a i with a , ai e A . If A is a basis, but no proper subset of A is a basis, then A is a minimal basis . A nonbasis is a set of nonnegative integers that is not a basis, and a nonbasis A is maximal if every proper superset of A is a basis . In this paper, minimal bases ...
متن کاملEvaluation of wall thickness and porosity effects on the conjugate free convection heat transfer rate of hybrid nanofluid inside a square cavity
At present study, effects of wall thickness and porosity on the conjugate free convection heat transfer inside a square cavity have been examined. Continuity, momentum and energy equations for fluid and solid matrix phases are governing equations in present work. Mentioned equations and related boundary conditions have been transformed into their non-dimensional forms. They are solved using fin...
متن کاملAn Algorithm to Generate Square-Free Numbers and to Compute the Moebius Function
We introduce an algorithm that iteratively produces a sequence of natural numbers ki and functions bi defined in the interval [1,+∞). The number ki+1 arises as the first point of discontinuity of bi above ki. We derive a set of properties of both sequences, suggesting that (1) the algorithm produces square-free numbers ki, (2) all the square-free numbers are generated as the output of the algor...
متن کاملCounting Square-Free Numbers
The main topic of this contribution is the problem of counting square-free numbers not exceeding n. Before this work we were able to do it in time Õ( √ n). Here, the algorithm with time complexity Õ(n) and with memory complexity Õ(n) is presented. Additionally, a parallel version is shown, which achieves full scalability. As of now the highest computed value was for n = 10. Using our implementa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Formalized Mathematics
دوره 21 شماره
صفحات -
تاریخ انتشار 2013